On Asynchronous Session Semantics

This paper studies a behavioural theory of the π-calculus with session types under the fundamental principles of the practice of distributed computing — asynchronous communication which is order-preserving inside each connection (session), augmented with asynchronous inspection of events (message arrivals). A new theory of bisimulations is introduced, distinct from either standard asynchronous or synchronous bisimilarity, accurately capturing the semantic nature of session-based asynchronously communicating processes augmented with event primitives. The bisimilarity coincides with the reduction-closed barbed congruence. We examine its properties and compare them with existing semantics. Using the behavioural theory, we verify that the program transformation of multithreaded into event-driven session based processes, using Lauer-Needham duality, is type and semantic preserving

Field-induced commensurate long-range order in the Haldane-gap system NDMAZ

High-field neutron diffraction studies of the new quantum-disordered S=1 linear-chain antiferromagnet Ni(C$_5$H$_{14}$N$_2$)$_2$N$_3$(ClO$_4$) (NDMAZ) are reported. At T=70 mK, at a critical field $H_c=13.4$ T applied along the (013) direction, a phase transition to a commensurate N\'{e}el-like ordered state is observed. The results are discussed in the context of existing theories of quantum phase transitions in Haldane-gap antiferromagnets, and in comparions with previous studies of the related system Ni(C$_5$H$_{14}$N$_2$)$_2$N$_3$(PF$_6$)

Simple examples of distinct Liouville-type symplectic structures

We discuss some examples of open manifolds which admit non-isomorphic symplectic structures of Liouville type.Comment: v2: one remark added, minor change

Program logics for homogeneous meta-programming.

A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming – using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics

On Observing Dynamic Prioritised Actions in SOC

We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and weak labelled bisimilarities for COWS, a process calculus for SOC, and provide alternative characterisations in terms of open barbed bisimilarities. These semantics show that COWS’s priority mechanisms partially recover the capability to observe receive actions (that could not be observed in a purely asynchronous setting) and that high priority primitives for termination impose specific conditions on the bisimilarities

Field induced long-range-ordering in an S=1 quasi-one-dimensional Heisenberg antiferromagnet

We have measured the heat capacity and magnetization of the spin one one-dimensional Heisenberg antiferromagnet NDMAP and constructed a magnetic field versus temperature phase diagram. We found a field induced long-range magnetic ordering. We have been successful in explaining the phase diagram theoretically.Comment: 6 pages, 18 figure

An Introduction to Pervasive Interface Automata

Pervasive systems are often context-dependent, component based systems in which components expose interfaces and offer one or more services. These systems may evolve in unpredictable ways, often through component replacement. We present pervasive interface automata as a formalism for modelling components and their composition. Pervasive interface automata are based on the interface automata of Henzinger et al, with several significant differences. We expand their notion of input and output actions to combinations of input, output actions, and callable methods and method calls. Whereas interfaces automata have a refinement relation, we argue the crucial relation in pervasive systems is component replacement, which must include consideration of the services offered by a component and assumptions about the environment. We illustrate pervasive interface autmotata and component replacement with a small case study of a pervasive application for sports predictions